Coloring and extremal problems in combinatorics by Jacob Manske
نویسندگان
چکیده
ii DEDICATION To M. and D., for making me who I am today. iii If people did not sometimes do silly things, nothing intelligent would ever get done. There's no ulterior practical purpose here. I'm just playing. That's what math is – wondering, playing, amusing yourself with your imagination.
منابع مشابه
The vector graph and the chromatic number of the plane, or how NOT to prove that χ(E2)>4
The chromatic number χ (E) of the plane is known to be some integer between 4 and 7, inclusive. We prove a limiting result that says, roughly, that one cannot increase the lower bound on χ (E) by pasting Moser spindles together—even countably many—by taking translations by Zlinear combinations of a certain set of vectors.
متن کاملEssays in extremal combinatorics
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
متن کاملShort Proofs of Some Extremal Results
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
متن کاملMAT 307 : Combinatorics Lecture 9 - 10 : Extremal combinatorics
1 Bipartite forbidden subgraphs We have seen the Erdős-Stone theorem which says that given a forbidden subgraph H, the extremal number of edges is ex(n,H) = 2(1−1/(χ(H)−1)+o(1))n. Here, o(1) means a term tending to zero as n → ∞. This basically resolves the question for forbidden subgraphs H of chromatic number at least 3, since then the answer is roughly cn2 for some constant c > 0. However, f...
متن کاملUniversal Poisson and Normal Limit Theorems in Graph Coloring Problems with Connections to Extremal Combinatorics
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. The limit theorems are universal depending solely on the limiting behavior of the ratio of the number of edges in the graph and the number of colors, and works for any graph sequence deterministic or random. The proofs are based on moment calculations which relates to res...
متن کامل